BCH codes of length 511
نویسندگان
چکیده
منابع مشابه
Studying the locator polynomials of minimum weight codewords of BCH codes
We consider only primitive binary cyclic codes of length n = 2 m ? 1. A BCH-code with designed distance is denoted B(n;). A BCH-code is always a narrow-sense BCH-code. A codeword is identiied with its locator polynomial, whose coeecients are the symmetric functions of the locators. The deenition of the code by its zeros-set involves some properties for the power sums of the locators. Moreover t...
متن کاملNarrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over GF(q) with length n = (qm−1)/(q−1). Little is known about ...
متن کاملSome Hermitian Dual Containing BCH Codes and New Quantum Codes
Let q = 3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q2-ary narrow-sense (NS) BCH codes of length n = (q 6−1) 3 and n = 3(q 2 −1)(q2 +q+1) are determined. For each given n, non-narrow-sense (NNS) BCH codes which achieve such maximal designed distances are presented, and a series of NS and NNS BCH codes are constructed and their parameters are comput...
متن کاملMaximum-likelihood soft decision decoding of BCH codes
The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all the primitive BCH codes. as well as i...
متن کاملGeneralized parallel concatenated block codes based on BCH and RS codes, construction and Iterative decoding
In this paper, a generalization of parallel concatenated block (GPCB) codes based on BCH and RS codes is presented. On the sender side two systematic encoders are used and separated by an interleaver. In the receiver side, the Chase-Pyndiah algorithm is utilized as component decoder in an iterative process. The effect of various component codes, interleaver sizes and patterns, and the number of...
متن کامل